Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - tsp c

Search list

[AI-NN-PR] tsp

Description: C语言实现的遗传算法解TSP问题（旅行商问题），简单易懂。-C Language Implementation of Genetic Algorithm for TSP problem (TSP), easy-to-read.
Platform: | Size: 12288 | Author: 李诗高 | Hits:

[AI-NN-PR] TspGA

Description: 采用遗传算法来实现求解TSP问题,使用Visual C++实现的.-Using genetic algorithm to realize the issue of solving the TSP, the use of Visual C++ Achievable.
Platform: | Size: 44032 | Author: lxz | Hits:

[Mathimatics-Numerical algorithms] dp_tsp

Description: TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -TSP dynamic programming to solve the problem. Description of the problem: traveling salesman problem, namely TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel businessmen to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.
Platform: | Size: 1045504 | Author: 黄艺敏 | Hits:

[AI-NN-PR] AntTsp

Description: 解决旅行商问题的C++代码，可以欣赏以下-Solve the Traveling Salesman Problem C++ Code, you can enjoy the following
Platform: | Size: 3072 | Author: 有偿编程，挣点生活费 | Hits:

[Windows Develop] TspByDP

Description: TSP问题的动态规化求解方法 TSP 问题的动态规化求解方法 -TSP problem of dynamic regulation of TSP problem solving method of the dynamic regulation method
Platform: | Size: 3072 | Author: | Hits:

[AI-NN-PR] TSPsource

Description: 用C++实现的蚁群算法解决TSP问题源码-With C++ Realize the ant colony algorithm to solve TSP problem source
Platform: | Size: 3072 | Author: cuiweixiong | Hits:

[Data structs] TSP

Description: 用C++实现了解决6*6矩阵的TSP问题!!!含有源代码!-With C++ Realize the solution to 6* 6 matrix TSP problem!!! Containing the source code!
Platform: | Size: 3072 | Author: 吴应龙 | Hits:

[AI-NN-PR] C-TSP

Description: 基于改进后的遗传算法 交叉、变异操作后，在windows平台下用C语言实现求解TSP问题-Based on the improved genetic algorithm crossover and mutation operation, in windows platform using C language for solving TSP problems
Platform: | Size: 3072 | Author: lc | Hits:

[Internet-Network] ChristofidesAlgorithm

Description: TSP的近似算法，克里斯托弗算法，近似度最好的-TSP approximation algorithms, Christopher algorithms, approximation degree of the best
Platform: | Size: 1220608 | Author: liubo | Hits:

[CSharp] TSP

Description: 这是一个货郎担问题的动态规划代码,是C语言版的,能在TC上和VC++6.0上运行.加入了许多注释.-This is a traveling salesman problem dynamic programming code, is a C language version, can TC and VC++ 6.0 run. Adding a lot of notes.
Platform: | Size: 2048 | Author: zhoulitc | Hits:

[VC/MFC] tspapp_src

Description: The source code of Travelling Salesman Problem. Implement in Visual C++.
Platform: | Size: 121856 | Author: jantima | Hits:

[AI-NN-PR] TSPProblem

Description: tsp问题,对于求解TSP问题设计的算法来解决TSP问题是一个很基本的算法.-tsp problem solving TSP problem for the design of algorithms to solve the TSP problem is a very basic algorithm.
Platform: | Size: 32768 | Author: 王志杰 | Hits:

[CSharp] tsp

Description: 用分支定界法求解旅行商问题旅行商问题是一个经典NP问题：有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来。-Using branch and bound method for solving traveling salesman problem traveling salesman problem is a classic NP problem: have n cities, a salesman from one of a city of departure, each city can only traverse once traveled all the requirements of the City , and then returned to his starting city, and all the possible path of the shortest path to a path.
Platform: | Size: 4096 | Author: bianbian | Hits:

[Other] tsp

Description: 针对数学建模中的某一送货运输问题的C语言实现-For mathematical modeling of a delivery transport issues realize C language
Platform: | Size: 12288 | Author: 管士平 | Hits:

[AI-NN-PR] TSp

Description: cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.
Platform: | Size: 11264 | Author: 岳明 | Hits:

[CSharp] TSP

Description: 利用C#画完全图，获取鼠标位置，响应鼠标事件-The use of C# Painting complete graph to obtain the mouse position, in response to mouse events
Platform: | Size: 35840 | Author: xiaorui | Hits:

[AI-NN-PR] soa_tsp

Description: 由 Visual C++ 编译过，可以求解任何个数城市的tsp问题，只要输入城市坐标即可。-By Visual C++ Compiled, you can to solve any number of cities tsp, so long as you enter the city coordinates.
Platform: | Size: 61440 | Author: 阳光 | Hits:

[AI-NN-PR] Ant_tspC

Description: c语言编写的蚁群算法源程序，应用于TSP-c language source code of ant colony algorithm applied to TSP
Platform: | Size: 139264 | Author: 张健 | Hits:

[AI-NN-PR] TS-TSP

Description: 使用禁忌搜索算法求解TSP（旅行商问题）的JAVA源程序-The use of tabu search algorithm for solving TSP (Traveling Salesman Problem) the JAVA source code
Platform: | Size: 3072 | Author: ann | Hits:

[Linux-Unix] tsp

Description: 用动态规划法求解TSP问题的C++源码 在Linux中用g++编译通过-Using dynamic programming method for solving TSP problems C++ Source code in Linux using g++ Compiled through
Platform: | Size: 1024 | Author: L.Zhang | Hits:
« 1 2 3 45 6 7 8 9 10 ... 28 »

CodeBus www.codebus.net